换热型节能技术在基站中的应用研究

换热型节能技术虽在基站中得到了大量应用,但由于应用场景至今还没有科学客观定量评估规定,使工程实施处于一种无章可循的尴尬局面,阻碍了换热型节能技术的进一步推广和应用。深入研究分析了基站内各类设备工作环境温湿度、空气清洁度和换热型节能设备能效比等技术指标,对比了不同标准中相关技术指标,指出了不同标准相关技术指标差别和部分标准存在的问题,并结合大气空气质量和环境温度等因素,提出了换热型节能技术应用场景和新风系统工程设计方法。     

大尹格庄金矿深部采场稳定性分析与参数优化

以大尹格庄金矿-616m水平8204采场为工程依托,对采场进行稳定性分析及结构参数优化。为此,对8204采场进行工程地质调查、矿岩力学性质试验,并应用Q系统和RMR分级法对采场岩体质量进行评价。基于Mathews稳定性图表法、临界跨度图表法和数值模拟,对采场尺寸和最大跨度进行优化。分析认为,8204采场的最佳跨度为12m,并将其结果应用于现场。结果表明,采用采场暴露面尺寸为12m×100m的结构参数进行回采,采场顶板及围岩并未发生垮落及剥落现象,采场稳定性良好。     

Spatial analyses of wildlife contact networks

Datasets from which wildlife contact networks of epidemiological importance can be inferred are becoming increasingly common. A largely unexplored facet of these data is finding evidence of spatial constraints on who has contact with whom, despite theoretical epidemiologists having long realized spatial constraints can play a critical role in infectious disease dynamics. A graph dissimilarity measure is proposed to quantify how close an observed contact network is to being purely spatial whereby its edges are completely determined by the spatial arrangement of its nodes. Statistical techniques are also used to fit a series of mechanistic models for contact rates between individuals to the binary edge data representing presence or absence of observed contact. These are the basis for a second measure that quantifies the extent to which contacts are being mediated by distance. We apply these methods to a set of 128 contact networks of field voles (Microtus agrestis) inferred from mark–recapture data collected over 7 years and from four sites. Large fluctuations in vole abundance allow us to demonstrate that the networks become increasingly similar to spatial proximity graphs as vole density increases. The average number of contacts, , was (i) positively correlated with vole density across the range of observed densities and (ii) for two of the four sites a saturating function of density. The implications for pathogen persistence in wildlife may be that persistence is relatively unaffected by fluctuations in host density because at low density is low but hosts move more freely, and at high density is high but transmission is hampered by local build-up of infected or recovered animals.     

Network morphospace

The structure of complex networks has attracted much attention in recent years. It has been noted that many real-world examples of networked systems share a set of common architectural features. This raises important questions about their origin, for example whether such network attributes reflect common design principles or constraints imposed by selectional forces that have shaped the evolution of network topology. Is it possible to place the many patterns and forms of complex networks into a common space that reveals their relations, and what are the main rules and driving forces that determine which positions in such a space are occupied by systems that have actually evolved? We suggest that these questions can be addressed by combining concepts from two currently relatively unconnected fields. One is theoretical morphology, which has conceptualized the relations between morphological traits defined by mathematical models of biological form. The second is network science, which provides numerous quantitative tools to measure and classify different patterns of local and global network architecture across disparate types of systems. Here, we explore a new theoretical concept that lies at the intersection between both fields, the ‘network morphospace’. Defined by axes that represent specific network traits, each point within such a space represents a location occupied by networks that share a set of common ‘morphological’ characteristics related to aspects of their connectivity. Mapping a network morphospace reveals the extent to which the space is filled by existing networks, thus allowing a distinction between actual and impossible designs and highlighting the generative potential of rules and constraints that pervade the evolution of complex systems.     

面向社交网络分析的差分隐私保护研究综述

阐述了数据的差分隐私保护概念,给出了差分隐私保护模型,从理论上描述了其噪声机制和组合性质,着重进述了差分隐私保护模型在社交网络发布数据隐私保护上的应用及发展,给出了差分隐私保护应用于度分布查询、子图计数、聚类系数计算、边权重计算等社交网络分析技术的实验结果。分析发现,研究差分隐私保护应重点考虑隐私预算和噪声机制,隐私预算决定了隐私保护强度,噪声机制决定了查询准确性;探讨差分隐私保护在社交网络领域的应用,是一个重要的研究方向。     

Mobile Design as Neighborhood Acupuncture: Activating the Storytelling Networks of South Los Angeles

Abstract

A delicate touch is required to empower neighborhoods using civic media. Funding is persistently scarce. Especially in marginalized neighborhoods, blunt designs can be counterproductive and even entrench complex problems. New metaphors may be needed to guide design and empower local neighborhoods. Urban acupuncture is used as the basis for this study, emphasizing a light-touch strategy that has shown success in Brazil with urban transit, and more recently in Europe with urban design. We specifically propose “neighborhood acupuncture” to address the local level, tapping the sociology of place-based communication. To investigate the implications for systematic design, a case study is probed in South Los Angeles using mobile media for community mapping. Using qualitative methods, three tactics were investigated for the potential to “poke” the network into action, including one to bridge diverse storytelling networks. Each tactic ultimately seeks to build the capacity for collective action around neighborhood issues. Acupuncture is broadly argued to sustain two design shifts: first to help approach neighborhoods as ecosystems, and second, to design for circulation rather than any single technology platform.     

空间尺度的意义——邻里中心模式下珠海市住区公共设施规划的思考

从空间尺度分析的角度入手,追溯我国住区公共设施规划演变,并审视邻里中心模式的内涵:邻里中心是邻里交往、公共生活的中心,而非单纯的公共设施集中布局的用地,其规划不仅仅要关注公共设施功能配置,也要加强对规模尺度及空间布局的重视。以珠海市邻里中心规划指标体系研究为例,提出调整住区公共设施配套规划的思路和建议:体系上,简化分级,以在邻里住区单元强化生活中心为主,构建层级体系为辅;尺度上,以400~500m半径的步行尺度而非设施尺度构建邻里住区单元;功能上,形成公益性设施和经营性设施并重的功能组成;空间上,以组织公共生活为原则构建公共设施布局模式。     

Predicting metamorphic relations for testing scientific software: a machine learning approach using graph kernels

Comprehensive, automated software testing requires an oracle to check whether the output produced by a test case matches the expected behaviour of the programme. But the challenges in creating suitable oracles limit the ability to perform automated testing in some programmes, and especially in scientific software. Metamorphic testing is a method for automating the testing process for programmes without test oracles. This technique operates by checking whether the programme behaves according to properties called metamorphic relations. A metamorphic relation describes the change in output when the input is changed in a prescribed way. Unfortunately, finding the metamorphic relations satisfied by a programme or function remains a labour‐intensive task, which is generally performed by a domain expert or a programmer. In this work, we propose a machine learning approach for predicting metamorphic relations that uses a graph‐based representation of a programme to represent control flow and data dependency information. In earlier work, we found that simple features derived from such graphs provide good performance. An analysis of the features used in this earlier work led us to explore the effectiveness of several representations of those graphs using the machine learning framework of graph kernels, which provide various ways of measuring similarity between graphs. Our results show that a graph kernel that evaluates the contribution of all paths in the graph has the best accuracy and that control flow information is more useful than data dependency information. The data used in this study are available for download at http://www.cs.colostate.edu/saxs/MRpred/functions.tar.gz to help researchers in further development of metamorphic relation prediction methods. Copyright © 2015 John Wiley & Sons, Ltd.     

基于紧密中心性的无线mesh骨干网网关部署

将定向天线和Delaunay图应用于无线mesh骨干网络的网关部署,提出了基于紧密中心性的无线mesh骨干网络网关部署算法。根据已知的mesh路由器和网关的最大流通量对网络进行划分,形成Delaunay子图,在划分的子图中根据欧几里德距离找出距离中心点最近的3个节点,形成候选网关集,在候选网关集中选择到其他节点总路径最短的节点作为网关的部署位置,将每个子图的网关位置输出。仿真结果表明,根据网关最大流通量进行合理网络划分后,算法能最小化网络的网关数量,由mesh路由器到网关的总路径长度优于随机算法。     

电信大规模社交关系网络图数据挖掘研究

电信技术的发展使得通话网络几乎覆盖了整个社会,对电信运营商来说,这个庞大的社会网络蕴藏着巨大的商机.尤其在日益激烈的市场竞争中,客户关系的维护、客户潜在价值的挖掘以及有针对性地对客户进行营销等对电信图数据的挖掘,受到了强烈关注.通过对比,研究了当前针对类似电信网络的大规模社交关系网络图数据进行挖掘的分布式和单机图计算工具和框架,并对单机图计算工具Graphchi的单机处理数据能力进行了可行性和可用性测试,同时采用单机Graphchi对电信社交关系网络的数据进行了图挖掘研究和应用.